package com.saul.datastructure.tree;

/**
 * @author 枫伦
 * @DESCRIPTION
 * @create 2021/10/9 5:38 下午
 */
public interface Tree {
    //查找节点
    public Node find(int key);

    //插入新节点
    public boolean insert(int data);

    //中序遍历
    public void infixOrder(Node current);

    //前序遍历
    public void preOrder(Node current);

    //后序遍历
    public void postOrder(Node current);

    //查找最大值
    public Node findMax();

    //查找最小值
    public Node findMin();

    //删除节点
    public boolean delete(int key);

    //Other Method......
}

